New Upper Bounds on Sphere Packings I
ثبت نشده
چکیده
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
منابع مشابه
New Upper Bounds on Sphere Packings I
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
متن کاملNew Upper Bounds on Sphere Packings I
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
متن کامل1 O ct 2 00 1 NEW UPPER BOUNDS ON SPHERE PACKINGS
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through 36. We conjecture that our approach can be used to solve the sphere packing problem in dimensions 8 and 24.
متن کاملUpper Bounds for Packings of Spheres of Several Radii
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of spherical caps and of convex bodies through the use of semidefinite programming. We perform explicit computations, obtaining new bounds for pa...
متن کاملNew bounds for multiple packings of Euclidean sphere
Using lower bounds on distance spectrum components of a code on the Euclidean sphere, we improve the known asymptotical upper bounds on the cardinality of multiple packings of the sphere by balls of smaller radii. Let Rn be the n-dimensional Euclidean space, and Sn−1(r) ⊂ Rn be the (closed) Euclidean sphere of radius r with the center in the origin. Let further S̃n−1(r, ā) be the open ball of ra...
متن کامل